A Cache Model of the Block Correlations Directed Cache Replacement Algorithm
نویسنده
چکیده
This paper proposes a cache model of the Block Correlations Directed cache replacement algorithm (BCD). Since the predication success rate of accesses decides the BCD’s hit ratio, the cache model analysis the utilization of the cache space improved by the correct predications and the penalty incurred by incorrect predications to estimate the hit rate of BCD. The model can also optimize the parameters of BCD to achieve theoretical optimum of such spatial locality based likely replacement algorithms. For most workloads of real systems the model of BCD can reduce deviation by 2.1%-21.8%.
منابع مشابه
Reduction in Cache Memory Power Consumption based on Replacement Quantity
Today power consumption is considered to be one of the important issues. Therefore, its reduction plays a considerable role in developing systems. Previous studies have shown that approximately 50% of total power consumption is used in cache memories. There is a direct relationship between power consumption and replacement quantity made in cache. The less the number of replacements is, the less...
متن کاملReduction in Cache Memory Power Consumption based on Replacement Quantity
Today power consumption is considered to be one of the important issues. Therefore, its reduction plays a considerable role in developing systems. Previous studies have shown that approximately 50% of total power consumption is used in cache memories. There is a direct relationship between power consumption and replacement quantity made in cache. The less the number of replacements is, the less...
متن کاملVictim Caching with Better Block Replacement
Cache memories help bridge the cycle-time gap between fast microprocessors and relatively slow main memories. By holding recently referenced regions of memory, caches can reduce the number of cycles the processor must stall while waiting for data. As the disparity between processor and main memory cycle times increases by 40 percent or more per year cache performance becomes ever more critical....
متن کاملEnergy Efficient Buffer Cache Replacement
Power consumption is an increasingly impressing concern for data servers as it directly affects running costs and system reliability. Prior studies have shown most memory space on data servers are used for buffer caching and thus cache replacement becomes critical. This paper investigates the tradeoff between these two interacting factors and proposes three energy-aware buffer cache replacement...
متن کاملA Preliminary Attempt for an Analytical Cache Replacement Algorithm Based on Poisson Processes and Maximum Likelihood Estimator
The Least Recently Used (LRU) algorithm has long been the most widely used algorithm for cache replacement. LRU boldly assumes that a block that is least recently used will be the least probable of being reused in the near future and thus should be replaced on contention. Unlike the LRU algorithm, which makes assumption of likelihood, this paper tentatively presents an analytical approach, usin...
متن کامل